Diierence Matching
نویسنده
چکیده
Diierence matching is a generalization of rst-order matching where terms are made identical both by variable instantiation and by structure hiding. After matching, the hidden structure may be removed by a type of controlled rewriting, called rippling, that leaves the rest of the term unaltered. Rippling has proved highly successful in inductive theorem proving. Diierence matching allows us to use rippling in other contexts, e.g., equational, inequational, and propositional reasoning. We present a diierence matching algorithm, its properties, several applications, and suggest extensions.
منابع مشابه
A Slowness Matching Nite Diierence Method for Traveltimes beyond Transmission Caustics
Conventional nite diierence eikonal solvers produce only the rst arrival time. However suitable solvers (of suuciently high order of accuracy) may be extended via Fermat's principle to yield a simple algorithm which computes all traveltimes to each subsurface point, with cost on the same order as that of a rst arrival solver.
متن کاملSAT decision by adding colour to matching theory
The augmenting path technique of matching theory is extended by adding some colour. As an application a SAT decision procedure for conjunctive normal forms is obtained, yielding polynomial time SAT decision in case the diierence c(F 0
متن کاملApproximately Matching Context - Free
Given a string w and a pattern p, approximate pattern matching merges traditional sequence comparison and pattern matching by asking for the minimum diierence between w and a string exactly matched by p. We give an O(PN 2 (N + logP)) algorithm for approximately matching a string of length N and a context-free language speciied by a grammar of size P. The algorithm generalizes the Cocke-Younger-...
متن کاملThe Use of Proof Plans to Sum Series
We describe a program for nding closed form solutions to nite sums. The program was built to test the applicability of the proof planning search control technique in a domain of mathematics outwith induction. This experiment was successful. The series summing program extends previous work in this area and was built in a short time just by providing new series summing methods to our existing ind...
متن کاملKorean Information Retrieval Model Based on the Principles of Word Formation
This paper presents an information retrieval model based on the principles of word formation to alleviate the mismatch between index terms and query terms. The model provides the partial matching method using morphological information which represent how morphemes consist of words. In this paper, we suggest a eecient method of dealing with derived words and compound words. The contribution of t...
متن کامل